constructing graceful graphs with caterpillars

Authors

christian barrientos

department of mathematics, clayton state university, morrow, georgia 30260, usa sarah minion

department of mathematics, clayton state university, morrow, georgia 30260, usa

abstract

a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f is called an -labeling and g is said to be an α-graph. a tree is a caterpillar if the deletion of all its leaves results in a path. in this work we study graceful labelings of the disjoint :union: of a cycle and a caterpillar. we present necessary conditions for this :union: to be graceful and, in the case where the cycle has even size, to be an α -graph. in addition, we present a new family of graceful trees constructed using α-labeled caterpillars.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

full text

Constructing Trees with Graceful Labellings Using Caterpillars

Hrnciar and Haviar [3] gave a method to a construct a graceful labeling for all trees of diameter at most five. Based on their method and the methods described in Balbuena et al [1], we shall describe a new construction for gracefully labeled trees by attaching trees to the vertices of a tree admitting a bipartite graceful labeling.

full text

Snakes and Caterpillars in Graceful Graphs

Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...

full text

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

full text

Super Vertex Graceful Graphs

For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”. Mathematics Subject Classification: 05C78

full text

My Resources

Save resource for easier access later


Journal title:
journal of algorithms and computation

جلد ۴۸، شماره ۱، صفحات ۱۱۷-۱۲۵

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023